/*
 * Copyright (c) 2014 Travis Cross <tc@traviscross.com>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

struct bit_trie_node {
  struct bit_trie_node *next[2];
  void *value;
  uint32_t value_len;
};

struct bit_trie_node* bit_trie_create();
uint32_t bit_trie_get(struct bit_trie_node **node_out,
                      struct bit_trie_node *node,
                      unsigned char *key,
                      uint32_t key_len);
struct bit_trie_node* bit_trie_set(struct bit_trie_node *node,
                                   unsigned char *key,
                                   uint32_t key_len,
                                   void *value,
                                   uint32_t value_len);
uint32_t bit_trie_free(struct bit_trie_node *node);
uint32_t bit_trie_byte_size(struct bit_trie_node *node);
